Sorting Morphisms
نویسنده
چکیده
Sorting algorithms can be classiied in many diierent ways. The way presented here is by expressing the algorithms as functional programs and to classify them by means of their recursion patterns. These patterns on their turn can be classiied as the natural recursion patterns that destruct or construct a given data-type, the so called cata-and anamorphisms respectively. We show that the selection of the recursion pattern can be seen as the major design decision, in most cases leaving no more room for more decisions in the design of the sorting algorithm. It is also shown that the use of alternative data structures may lead to new sorting algorithms. This presentation also serves as a gentle, lightweight , introduction into the various morphisms.
منابع مشابه
On morphisms of crossed polymodules
In this paper, we prove that the category of crossed polymodules (i.e. crossed modules of polygroups) and their morphisms is finitely complete. We, therefore, generalize the group theoretical case of this completeness property of crossed modules.
متن کاملToroidalization of locally toroidal morphisms of 3-folds
A toroidalization of a dominant morphism $varphi: Xto Y$ of algebraic varieties over a field of characteristic zero is a toroidal lifting of $varphi$ obtained by performing sequences of blow ups of nonsingular subvarieties above $X$ and $Y$. We give a proof of toroidalization of locally toroidal morphisms of 3-folds.
متن کاملcontaining detail proofs for paper : Sorting suffixes of two - pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial division of the suffixes of x into two sets: in step 1 sort the first set using recursive reduction of the problem, in step 2 determine the order of the suffixes in the second set based on the order of the suffixes in th...
متن کاملFrom torsion theories to closure operators and factorization systems
Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].
متن کاملÉtale Morphisms of Schemes
Contents 1. Introduction 1 2. Conventions 2 3. Unramified morphisms 2 4. Three other characterizations of unramified morphisms 4 5. The functorial characterization of unramified morphisms 5 6. Topological properties of unramified morphisms 6 7. Universally injective, unramified morphisms 7 8. Examples of unramified morphisms 9 9. Flat morphisms 10 10. Topological properties of flat morphisms 11...
متن کامل